Inference of Sequential Association Rules Guided by Context-Free Grammars
نویسندگان
چکیده
One of the main unresolved problems in data mining is related with the treatment of data that is inherently sequential. Algorithms for the inference of association rules that manipulate sequential data have been proposed and used to some extent but are ineffective, in some cases, because too many candidate rules are extracted and filtering the relevant ones is difficult and inefficient. In this work, we present a method and algorithm for the inference of sequential association rules that uses context-free grammars to guide the discovery process, in order to filter, in an efficient and effective way, the associations discovered by the algorithm.
منابع مشابه
Using Context-Free Grammars to Constrain Apriori-based Algorithms for Mining Temporal Association Rules
Algorithms for the inference of association with sequential information have been proposed and used but are ineffective, in some cases, because too many candidate rules are extracted. Filtering the relevant ones is usually difficult and inefficient. In this work, we present an algorithm for the inference of temporal association rules that uses context-free grammars to restrict the search proces...
متن کاملThe Hardness Results of Actively Predicting Simple Subclasses of Context-Free Grammars
In this paper, we present the hardness results of actively predicting context-free grammars that the number of nonterminals is just one, that is sequential, that is properly sequential, and that the number of nonterminals appearing in the righthand side of each production is bounded by some constant. keywords: computational learning theory, prediction, grammatical inference, formal language
متن کاملPacific Association for Computational Linguistics EXPRESSING PROBABILISTIC CONTEXT-FREE GRAMMARS IN THE RELAXED UNIFICATION FORMALISM
The Theory of Relaxed Unification is a newly proposed theory that extends the power of classical unification. The theory relaxes the rigid constraints of requiring a perfect match between the terms being unified to allow multi-valued attributes. The Relaxed Unification Inference System is an implementation of an inference engine and an interpreter, which uses the relaxed unification mechanism i...
متن کاملBreeding Grammars: Grammatical Inference with a Genetic Algorithm
This paper presents a genetic algorithm used to infer context-free grammars from legal and illegal examples of a language. It discusses the representation of grammar rules in the form of bitstringsby way of an interval coding scheme, genetic operators for reproduction of grammars, and the method of evaluating the fitness of grammars with respect to the training examples. Results are reported on...
متن کاملTowards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of strings, and a set of features or tests that constrain various inference rules. Using this general framework, which we cast as a process of logical inference, we re-analyse Angluin’s famous lstar algorithm and several...
متن کامل